Bounded-Distance Soft Decision Decoding of Binary Product Codes
نویسنده
چکیده
A. two-step sub-optimal algorithm for decoding binary product codes is discussed. This algorithm realizes at least half the minimum Euclidean distance of the code. The fundamental geometric properties associated with the algorithm are investigated, and bounds on the number of nearest neighbors are derived. This investigation also results with an improved algorithm which achieves the minimum effective error coefficient, the number of minimumweight codewords in the product code.
منابع مشابه
Algebraic Soft-Decision Decoding of Reed-Solomon Codes Using Bit-level Soft Information
The performance of algebraic soft-decision decoding (ASD) of Reed-Solomon (RS) codes using bit-level soft information is investigated. Optimal multiplicity assignment strategies (MAS) of ASD with infinite cost are first studied over erasure channels and binary symmetric channels (BSC). The corresponding decoding radii are calculated in closed forms and tight bounds on the error probability are ...
متن کاملReed-Solomon Subcodes with Nontrivial Traces: Distance Properties and Soft-Decision Decoding
Reed-Solomon (RS) codes over GF(2) have traditionally been the most popular non-binary codes in almost all practical applications. The distance properties of RS codes result in excellent performance under hard-decision bounded-distance decoding. However, efficient and implementable soft decoding for high-rate (about 0.9) RS codes over large fields (GF(256), say) continues to remain a subject of...
متن کاملSoft Decision Decoding of Reed-Solomon Product Codes
Reed-Solomon codes are a class of non-binary cyclic codes which have strong burst and erasure error correction capabilities. Their current uses include deep-space communications, compact disc recordings, cellular communications, and digital broadcast[1]. Their popularity stems in part from the existence of encoding and decoding algorithms that are simple to implement in hardware. In addition to...
متن کاملChase-Like Bounded-Distance Decoding with O(d2/3) Trials
A soft-decision decoder for an error-correcting block code of Hamming distance d is said to achieve bounded-distance (BD) decoding if its error-correction radius is equal to that of a complete Euclidean distance decoder. The Chase decoding algorithms are reliability-based algorithms achieving BD decoding. The least complex version of the original Chase algorithms (“Chase-3”) uses O(d) trials of...
متن کاملEfficient bounded-distance decoding of the hexacode and associated decoders for the Leech lattice and the Golay code
Abstmct Two soft-decision algorithms f o r decoding the (6,3,4) q u a t e r n a r y code, the hezocode, are p resented. Both algorithms have the same guaranteed error cor rec t ion radius as that of maximum-likelihood decoding. In using them, bounded-distance decoding of the Golay code and the Leech lattice are performed i n at most 187 and 519 real operations respectively. We present s o m e s...
متن کامل